A Boxed Optimization Reformulation for the Convex Second Order Cone Programming
نویسندگان
چکیده
By using the the equivalent expression of the second order cone, we reformulate the convex second order cone programming as a boxed constrained optimization, which is a nonlinear programming with four nonnegative constraints. We give the conditions under which the stationary point of the reformulation problem solve the original problem.
منابع مشابه
Waveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملEfficient Recovery of Jointly Sparse Vectors
We consider the reconstruction of sparse signals in the multiple measurement vector (MMV) model, in which the signal, represented as a matrix, consists of a set of jointly sparse vectors. MMV is an extension of the single measurement vector (SMV) model employed in standard compressive sensing (CS). Recent theoretical studies focus on the convex relaxation of the MMV problem based on the (2, 1)-...
متن کاملTwo unconstrained optimization approaches for the Euclidean κ - centrum location problem
Consider the single-facility Euclidean κ-centrum location problem in R. This problem is a generalization of the classical Euclidean 1-median problem and 1-center problem. In this paper, we develop two efficient algorithms that are particularly suitable for problems where n is large by using unconstrained optimization techniques. The first algorithm is based on the neural networks smooth approxi...
متن کاملTwo unconstrained optimization approaches for the Euclidean kappa-centrum location problem
Consider the single-facility Euclidean j-centrum location problem in R. This problem is a generalization of the classical Euclidean 1-median problem and 1-center problem. In this paper, we develop two efficient algorithms that are particularly suitable for problems where n is large by using unconstrained optimization techniques. The first algorithm is based on the neural networks smooth approxi...
متن کامل